Isomorphisms of symplectic planes

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Isomorphisms of symplectic planes

Every nondesarguesian symplectic spread is also symplectic over its kernel. Any equivalence of nondesarguesian symplectic spreads preserves the resulting symplectic structures over the kernels. 2000 Mathematics Subject Classification. Primary 51A35, 51A40; Secondary 51A50

متن کامل

Compactification of the Symplectic Group via Generalized Symplectic Isomorphisms

Let G be a connected reductive algebraic group over an algebraically closed field k of characteristic zero. We have a left (G×G)-action on G defined as (g1, g2) ·x := g1xg −1 2 . A (G×G)-equivariant embedding G ↪→ X is said to be regular (cf. [BDP], [Br, §1.4]) if the following conditions are satisfied: (i) X is smooth and the complement X \G is a normal crossing divisor D1 ∪ · · · ∪Dn. (ii) Ea...

متن کامل

Symplectic translation planes and line ovals

A symplectic spread of a 2n-dimensional vector space V over GFðqÞ is a set of q þ 1 totally isotropic n-subspaces inducing a partition of the points of the underlying projective space. The corresponding translation plane is called symplectic. We prove that a translation plane of even order is symplectic if and only if it admits a completely regular line oval. Also, a geometric characterization ...

متن کامل

Theta functions on covers of symplectic groups

We study the automorphic theta representation $Theta_{2n}^{(r)}$ on the $r$-fold cover of the symplectic group $Sp_{2n}$‎. ‎This representation is obtained from the residues of Eisenstein series on this group‎. ‎If $r$ is odd‎, ‎$nle r

متن کامل

Isomorphisms of P4-graphs

For graphs G and G' with minimum degree is = 3 and satisfying one of two other conditions, we prove that any isomorphism from the P4 -graph P4 (G) to P4 ( G') can be induced by a vertex-isomorphism of G onto G'. We also prove that a connected graph G is isomorphic to its P4 -graph P4 (G) if and only if G is a cycle of length at least 4.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: advg

سال: 2007

ISSN: 1615-7168,1615-715X

DOI: 10.1515/advgeom.2007.033